Algorithmic proofs of two theorems of Stafford
نویسنده
چکیده
Two classical results of Stafford say that every (left) ideal of the n-th Weyl algebra An can be generated by two elements, and every holonomic An-module is cyclic, i.e. generated by one element. We modify Stafford’s original proofs to make the algorithmic computation of these generators possible.
منابع مشابه
The Concept of Sub-independence and Its Application in Statistics and Probabilities
Many Limit Theorems, Convergence Theorems and Characterization Theorems in Probability and Statistics, in particular those related to normal distribution , are based on the assumption of independence of two or more random variables. However, the full power of independence is not used in the proofs of these Theorems, since it is the distribution of summation of the random variables whic...
متن کاملA new version of algorithmic information theory
Algorithmic information theory may be viewed as the result of adding the idea of program-size complexity to recursive function theory. The main application of algorithmic information theory is its informationtheoretic incompleteness theorems. This theory is concerned with the size of programs, but up to now these have never been programs that one could actually program out and run on interestin...
متن کاملO(m) Bound on Number of Iterations in Sphere Methods for LP
Consider the linear program (LP): minimize z = cx, subject to Ax ≥ b, where A is an m×n matrix. Sphere methods (SMs) for solving this LP were introduced in Murty [5, 6], even though this name was not used there. Theorems in those papers claimed that a version of this method needs at most O(m) iterations to solve this LP, however Mirzaian [2] pointed out an error in the proofs of these theorems ...
متن کاملGödel incompleteness theorems and the limits of their applicability. I
This is a survey of results related to the Gödel incompleteness theorems and the limits of their applicability. The first part of the paper discusses Gödel’s own formulations along with modern strengthenings of the first incompleteness theorem. Various forms and proofs of this theorem are compared. Incompleteness results related to algorithmic problems and mathematically natural examples of unp...
متن کاملParallel Multivariate Meta-Theorems
Fixed-parameter tractability is based on the observation that many hard problems become tractable even on large inputs as long as certain input parameters are small. Originally, “tractable” just meant “solvable in polynomial time,” but especially modern hardware raises the question of whether we can also achieve “solvable in polylogarithmic parallel time.” A framework for this study of parallel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 38 شماره
صفحات -
تاریخ انتشار 2004